Codensity and the ultrafilter monad

نویسنده

  • Tom Leinster
چکیده

Even a functor without an adjoint induces a monad, namely, its codensity monad; this is subject only to the existence of certain limits. We clarify the sense in which codensity monads act as substitutes for monads induced by adjunctions. We also expand on an undeservedly ignored theorem of Kennison and Gildenhuys: that the codensity monad of the inclusion of (finite sets) into (sets) is the ultrafilter monad. This result is analogous to the correspondence between measures and integrals. So, for example, we can speak of integration against an ultrafilter. Using this language, we show that the codensity monad of the inclusion of (finite-dimensional vector spaces) into (vector spaces) is double dualization. From this it follows that compact Hausdorff spaces have a linear analogue: linearly compact vector spaces. Finally, we show that ultraproducts are categorically inevitable: the codensity monad of the inclusion of (finite families of sets) into (families of sets) is the ultraproduct monad. Now we have at last obtained permission to ventilate the facts. . . —Arthur Conan Doyle, The Adventure of the Creeping Man (1927)

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Codensity Liftings of Monads

We introduce a method to lift monads on the base category of a fibration to its total category using codensity monads. This method, called codensity lifting, is applicable to various fibrations which were not supported by the categorical >>-lifting. After introducing the codensity lifting, we illustrate some examples of codensity liftings of monads along the fibrations from the category of preo...

متن کامل

Companions, Causality and Codensity

In the context of abstract coinduction in complete lattices, the notion of compatible function makes it possible to introduce enhancements of the coinduction proof principle. The largest compatible function, called the companion, subsumes most enhancements and has been proved to enjoy many good properties. Here we move to universal coalgebra, where the corresponding notion is that of a final di...

متن کامل

Companions, Codensity and Causality

In the context of abstract coinduction in complete lattices, the notion of compatible function makes it possible to introduce enhancements of the coinduction proof principle. The largest compatible function, called the companion, subsumes most enhancements and has been proved to enjoy many good properties. Here we move to universal coalgebra, where the corresponding notion is that of a final di...

متن کامل

Kan Extensions for Program Optimisation Or: Art and Dan Explain an Old Trick

Many program optimisations involve transforming a program in direct style to an equivalent program in continuation-passing style. This paper investigates the theoretical underpinnings of this transformation in the categorical setting of monads. We argue that so-called absolute Kan Extensions underlie this program optimisation. It is known that every Kan extension gives rise to a monad, the code...

متن کامل

Eilenberg-Moore Monoids and Backtracking Monad Transformers

We develop an algebraic underpinning of backtracking monad transformers in the general setting of monoidal categories. As our main technical device, we introduce Eilenberg–Moore monoids, which combine monoids with algebras for strong monads. We show that Eilenberg–Moore monoids coincide with algebras for the list monad transformer (‘done right’) known from Haskell libraries. From this, we obtai...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013